ParaFormer: Parallel Attention Transformer for Efficient Feature Matching

نویسندگان

چکیده

Heavy computation is a bottleneck limiting deep-learning-based feature matching algorithms to be applied in many real-time applications. However, existing lightweight networks optimized for Euclidean data cannot address classical tasks, since sparse keypoint based descriptors are expected matched. This paper tackles this problem and proposes two concepts: 1) novel parallel attention model entitled ParaFormer 2) graph U-Net architecture with attentional pooling. First, fuses features positions through the concept of amplitude phase, integrates self- cross-attention manner which achieves win-win performance terms accuracy efficiency. Second, proposed pooling, ParaFormer-U variant significantly reduces computational complexity, minimize loss caused by downsampling. Sufficient experiments on various applications, including homography estimation, pose image matching, demonstrate that state-of-the-art while maintaining high The efficient comparable less than 50% FLOPs attention-based models.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient algorithms for robust feature matching

One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from a sensed image to their counterparts in a reference image. This leads to the fundamental problem of point matching: Given two sets of points, find the (affine) transformation that transforms one point set so that its distance from the other point set is minimized. Bec...

متن کامل

Efficient Parallel Algorithms for Template Matching

The parallel complexity of template matching has been well studied. In this paper we present more work-eÆcient algorithms than the existing ones. Our algorithms are based on FFT primitives. We consider the following models of computing: PRAM and the hypercube.

متن کامل

Efficient Parallel and External Matching

We study a simple parallel algorithm for computing matchings in a graph. A variant for unweighted graphs finds a maximal matching using linear expected work and Olog2 n expected running time in the CREW PRAMmodel. Similar results also apply to External Memory, MapReduce and distributed memory models. In the maximum weight case the algorithm guarantees a 1/2-approximation. Although the parallel ...

متن کامل

Efficient Parallel Feature Selection for Steganography Problems

The steganography problem consists of the identification of images hiding a secret message, which cannot be seen by visual inspection. This problem is nowadays becoming more and more important since the World Wide Web contains a large amount of images, which may be carrying a secret message. Therefore, the task is to design a classifier, which is able to separate the genuine images from the non...

متن کامل

Efficient Feature Matching by Progressive Candidate Search

We present a novel feature matching algorithm that systematically utilizes the geometric properties of features such as position, scale, and orientation, in addition to the conventional descriptor vectors. In challenging scenes with the presence of repetitive patterns or with a large viewpoint change, it is hard to find the correct correspondences using feature descriptors only, since the descr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i2.25275